📚 node [[convex_optimization|convex optimization]]
Welcome! Nobody has contributed anything to 'convex_optimization|convex optimization' yet. You can:
  • Write something in the document below!
    • There is at least one public document in every node in the Agora. Whatever you write in it will be integrated and made available for the next visitor to read and edit.
  • Write to the Agora from social media.
    • If you follow Agora bot on a supported platform and include the wikilink [[convex_optimization|convex optimization]] in a post, the Agora will link it here and optionally integrate your writing.
  • Sign up as a full Agora user.
    • As a full user you will be able to contribute your personal notes and resources directly to this knowledge commons. Some setup required :)
⥅ related node [[convex_optimization]]
⥅ node [[convex_optimization]] pulled by Agora
📓 garden/KGBicheno/Artificial Intelligence/Introduction to AI/Week 3 - Introduction/Definitions/Convex_Optimization.md by @KGBicheno

convex optimization

Go back to the [[AI Glossary]]

The process of using mathematical techniques such as gradient descent to find the minimum of a convex function. A great deal of research in machine learning has focused on formulating various problems as convex optimization problems and in solving those problems more efficiently.

For complete details, see Boyd and Vandenberghe, Convex Optimization.
📖 stoas
⥱ context
← back
ai glossary

↑ pushing here
(none)

↓ pulling this
(none)
→ forward
(none)
🔎 full text search for 'convex_optimization|convex optimization'